Remarks on Calculation of Autocorrelation on Finite Dyadic Groups by Local Transformations of Decision Diagrams

The paper considers calculation of autocorrelation functions on finite dyadic groups over decision diagrams. The methods exploit recursive structure of both autocorrelation matrices and decision diagrams. First, it is discussed calculation of the autocorrelation through the Wiener-Khinchin theorem implemented over decision diagrams. Then, it is proposed a method for calculation of separate autocorrelation coefficients over decision diagrams with permuted labels at the edges. For the case of restricted memory resources, a procedure with in-place calculations over the decision diagram for the function processed has been defined.